Variable Fanout

نویسندگان

  • Shawn Michael Herman
  • SHAWN MICHAEL HERMAN
چکیده

Data compression attempts to reduce the amount of information needed to recreate a signal. A source coder is a data compression system which attempts to maximize the quality of the signal reproduction for a xed transmission rate or minimize the transmission rate for a xed reproduction quality. Source coders are designed by exploiting the statistics of their signal sources. A vector quantizer can be used as a source coder. In this thesis, a generalized pruning technique called trimming is introduced which improves upon the performance of pruned tree-structured vector quantization. The algorithm designs a large balanced nonbinary tree and trims it back to create useful lower-rate subtrees. Trimming di ers from pruning in that it does not necessarily remove all descendants of the node being trimmed. However, appropriate codebook replacement is performed during each trim so that all codevectors within the trimmed subtree represent the centroids of their encoding cells. With trimming replacing pruning, the generalized BFOS algorithm of Chou, Lookabaugh, and Gray still identi es those subtrees which lie on the lower convex hull of the initial tree's operational distortion-rate function. It is shown experimentally that this new convex hull is often lower than the one found using pruning. In this sense, the new algorithm outperforms pruned tree-structured vector quantization. Both algorithms are allowed to time share at rates where no subtrees are located. To design the initial balanced nonbinary tree, it is su cient to specify the number of children each tree node will have. However, a constraint is imposed so that all nodes located at the same depth within the initial tree have the same number of children. For a given maximum rate constraint, there are clearly many iii initial tree structures which could be used. Specifying the initial tree structure is an extra degree of freedom not found with binary pruned tree-structured vector quantization. The new algorithm identi es the nonbinary tree which is optimal with respect to the transmission statistics of a multirate channel. Experimental results are supplied which demonstrate this performance. iv ACKNOWLEDGEMENTS I thank my advisor, Professor Kenneth Zeger, for guiding my research during the past two years. His numerous helpful suggestions made a vast improvement in the quality of this work and my abilities as a practicing engineer. This work was supported in part by a National Science Foundation Graduate Research Fellowship. v TABLE OF CONTENTS Page

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimizing Restricted-Fanout Queries

Sagiv, Y. and Y. Saraiya, Minimizing restricted-fanout queries, Discrete Applied Mathematics 40 ( 1992) 2455264. Conjunctive queries form an important subset of relational algebra. Each conjunctive query has a unique minimum equivalent (up to isomorphism). However, the computation of the minimum equivalent is complete for co-. u% Johnson and Klug have proposed a subclass of conjunctive queries,...

متن کامل

Variable Fanout Trimmed Tree-structured Vector Quantization for Multirate Channels 1

| We introduce a generalized pruning technique called trimming which can improve upon the performance of pruned tree-structured vector quantization. The algorithm is used to optimize the tree structure with respect to a multirate channel. Experimental results are supplied which demonstrate this performance .

متن کامل

Strictly Nonblocking f -cast d-ary Multi-log Networks under Fanout and Crosstalk Constraints

We derive conditions which are both necessary and sufficient for the d-ary multi-log switching networks to be f cast strictly nonblocking under all combinations of fanout and crosstalk constraints. The fanout constraint tells us which stage(s) of the networks has fanout capability. The crosstalk constraint tells us whether or not two connection routes are allowed to share a link (relevant to el...

متن کامل

A fanout optimization algorithm based on the effort delay model

This paper presents LEOPARD, a Logical Effort-based fanout OPtimizer for ARea and Delay, which relies on the availability of a (near) continuous size buffer library. Based on the concept of logical effort in VLSI circuits, the proposed algorithm attempts to minimize the total buffer area under the required time and input capacitance constraints by constructing the fanout tree topology and assig...

متن کامل

Reconvergent Fanout Removal Through Partial BIST Insertion

The chief goal of partial scan/BIST selection is to identify the minimum number of flip flops in a design which can be converted into test flip flops to enable high fault coverage. We propose the elimination of reconvergent fanout during partial scan/BIST selection by choosing flip flops on reconvergent fanout paths. We present a partial scan/BIST selection algorithm which minimizes reconvergen...

متن کامل

Partial BIST Insertion to Eliminate Data Correlation

A new partial BIST insertion approach based on eliminating data correlation to improve pseudo-random testability is presented. Data correlation causes the circuit to be in a subset of the states more or less frequently, which leads to low fault coverage in pseudo-random test. One important cause of correlation is reconvergent fanout. Incorporating BIST test flip-flops into reconvergent paths wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007